---
title: "1390. Four Divisors"
created: 2025-12-19
---
# 1390. Four Divisors

## 题目 [**1390. Four Divisors**](https://leetcode.com/problems/four-divisors/)

![[image-97412e94.png]]

## 思路分析

![[image-39225648.png]]

## 代码实现

```java
class Solution {
    public int sumFourDivisors(int[] nums) {
        int ans=0;
        for(int num : nums){
            int cnt=0;
            int sum=0;
            for(int i=1;i*i<=num;i++){
                if(num%i==0){
                    if(i*i == num){
                        cnt++;
                        sum+=i;
                    }
                    else{
                        cnt+=2;
                        sum+=(i+num/i);
                    }
                }
                if(cnt>4) break;  
            }
            if(cnt==4){
                ans+=sum;
            }
        }
        return ans;
    }
}
```

## 同类题型

## 视频讲解